On a uniformly random chord diagram and its intersection graph
نویسندگان
چکیده
منابع مشابه
Random Intersection Graph Process
Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...
متن کاملThe Expected Genus of a Random Chord Diagram
To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an oriented surface in which it may be realized. Let gn denote the expected genus of a randomly chosen oriented chord diagram of order n. We show that gn satisfies:
متن کاملOn Connectivity in a General Random Intersection Graph
Abstract There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graphG(n,−→a ,−→ Kn, Pn) defined on a set Vn comprising n vertices, where−→a is a probability vector (a1, a2, . . . , am) and −→ Kn is (K1,n,K2,n, . . . ,Km,n). This graph has been studied in the literature [10,11,20,29] including a most recent work...
متن کاملConnectivity of the uniform random intersection graph
A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...
متن کاملVertex Degree of Random Intersection Graph
A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.11.004